Mixed radix

Numeral systems by culture
Hindu-Arabic numerals
Western Arabic (Hindu numerals) Eastern Arabic Indian family Tamil	Burmese Khmer Lao Mongolian Thai
East Asian numerals
Chinese Japanese Suzhou	Korean Vietnamese Counting rods
Alphabetic numerals
Abjad Armenian Āryabhaṭa Cyrillic	Ge'ez Greek Georgian Hebrew
Other systems
Aegean Attic Babylonian Brahmi Egyptian Etruscan Inuit	Kharosthi Mayan Quipu Roman Sumerian Urnfield
List of numeral system topics
Positional systems by base
Decimal (10)
2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 20, 24, 30, 36, 60, 64
Non-positional system
Unary numeral system (Base 1)
List of numeral systems

Mixed radix numeral systems are non-standard positional numeral systems in which the numerical base varies from position to position. Such numerical representation applies when a quantity is expressed using a sequence of units that are each a multiple of the next smaller one, but not by the same factor. Such units are common for instance in measuring time; a time of 32 weeks, 5 days, 7 hours, 45 minutes, 15 seconds, and 500 milliseconds might be expressed as a number of minutes in mixed-radix notation as:

... 32, 5,  7, 45; 15,  500
...  ∞, 7, 24, 60; 60, 1000

or as

32_∞5₇7₂₄45₆₀.15₆₀500₁₀₀₀

In the tabular format, the digits are written above their base, and a semicolon is used to indicate the radix point. In numeral format, each digit has its associated base attached as a subscript, and the position of the radix point is indicated by a full stop. The base for each digit is the number of corresponding units that make up the next larger unit. As a consequence there is no base (written as ∞) for the first (most significant) digit, since here the "next larger unit" does not exist (and note that one could not add a larger unit of "month" or "year" to the sequence of units, as they are not integer multiples of "week").

1 Examples
2 Manipulation
3 Factorial number system
4 Prime radix number system
5 References
6 External links

Examples

A mixed radix numeral system can often benefit from a tabular summary. The familiar system for describing the 604800 seconds of a week starting from midnight on Sunday runs as follows:

Radix:	7	2	12	60	60
Denomination:	day	half-day	hour	minute	second
Place value (seconds):	86400	43200	3600	60	1
Digit translations …
day:	0=Sunday, 1=Monday, 2=Tuesday, 3=Wednesday, 4=Thursday, 5=Friday, 6=Saturday
half-day:	0=AM, 1=PM
hour:	0 is written as "12" (!)

In this numeral system, the mixed radix numeral 3₇1₂5₁₂51₆₀57₆₀ seconds would be interpreted as 05:51:57 p.m. on Wednesday, and 0₇0₂0₁₂02₆₀24₆₀ would be 12:02 :24 a.m. on Sunday. Ad hoc notations for mixed radix numeral systems are commonplace.

A second example of a mixed radix numeral system in current use is in the design and use of currency, where a limited set of denominations are printed or minted with the objective of being able to represent any monetary quantity; the amount of money is then represented by the number of coins or banknotes of each denomination. When deciding which denominations to create (and hence which radices to mix), a compromise is aimed for between a minimal number of different denominations, and a minimal number of individual pieces of coinage required to represent typical quantities. So, for example, in the UK, banknotes are printed for £50, £20, £10 and £5, and coins are minted for £2, £1, 50p, 20p, 10p, 5p, 2p and 1p—these follow the 1-2-5 series of preferred values. In theory, balanced ternary minimizes the number of pieces of coinage required to represent any quantity.

A historical example of a mixed radix numeral system is the system of Mayan numerals, which generally used base-20, except for the second place (the "10s" in decimal) which was base-18, so that the first two places counted up to 360 (an approximation to the number of days in the year).

Mixed-radix representation is also relevant to mixed-radix versions of the Cooley-Tukey FFT algorithm, in which the indices of the input values are expanded in a mixed-radix representation, the indices of the output values are expanded in a corresponding mixed-radix representation with the order of the bases and digits reversed, and each subtransform can be regarded as a Fourier transform in one digit for all values of the remaining digits.

Manipulation

Mixed-radix numbers of the same base can be manipulated using a generalization of manual arithmetic algorithms. Conversion of values from one mixed base to another is easily accomplished by first converting the place values of the one system into the other, and then applying the digits from the one system against these.

APL includes operators to convert to and from mixed-radix systems.

Factorial number system

Main article: Factorial number system

Another proposal is the so-called factorial number system:

Radix	8	7	6	5	4	3	2	1
Place value	7!	6!	5!	4!	3!	2!	1!	0!
Place value in decimal	5040	720	120	24	6	2	1	0
Highest digit allowed	7	6	5	4	3	2	1	0

For example, the biggest number that could be represented with six digits would be 543210 which equals 719 in decimal: 5×5! + 4×4! + 3×3! + 2×2! + 1×1! It might not be clear at first sight but the factorial based numbering system is unambiguous and complete. Every number can be represented in one and only one way because the sum of respective factorials multiplied by the index is always the next factorial minus one:

$\sum_{i=0}^{n} (([i%2B1]%2B1)-1) \cdot ([i]%2B1)! = ([n%2B1]%2B1)! - 1$

There is a natural mapping between the integers 0, ..., n! − 1 and permutations of n elements in lexicographic order, which uses the factorial representation of the integer, followed by an interpretation as a Lehmer code.

The above equation is a particular case of the following general rule for any radix (either standard or mixed) base representation which expresses the fact that any radix (either standard or mixed) base representation is unambiguous and complete. Every number can be represented in one and only one way because the sum of respective weights multiplied by the index is always the next weight minus one:

$\sum_{i=0}^{n} (m_{i%2B1} - 1) \cdot M_i = M_{n%2B1} - 1$ , where $M_i = \prod_{j=1}^{i} m_j, m_j > 1, M_0 = 1$ ,

which can be easily proved with mathematical induction.

Prime radix number system

Another interesting proposal is the number system with successive prime numbers as radix, whose place values are primorial numbers:

radix:	17	13	11	7	5	3	2
place value:	(p₆=13)#	(p₅=11)#	(p₄=7)#	(p₃=5)#	(p₂=3)#	(p₁=2)#	(p₀=1)#
decimal:	30030	2310	210	30	6	2	1

$\sum_{i=0}^{n} (p_{i%2B1} - 1) \cdot p_i\# = p_{n%2B1}\# - 1$ where $p_i\# = \prod_{j=1}^{i} p_j$ , and p_j = j^th prime, p₀# = p₀ = 1.

References

Donald Knuth. The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Third Edition. Addison-Wesley, 1997. ISBN 0-201-89684-2. Pages 65–66, 208–209, and 290.
Georg Cantor. Über einfache Zahlensysteme, Zeitschrift für Math. und Physik 14(1869), 121–128.

External links

"Comments on “An Arithmetic Free Parallel Mixed-Radix Conversion Algorithm”". Submitted to IEEE Trans. Circuits and Systems. By Antonio García,Student Member,IEEE, and Graham A. Jullien, Senior Member, IEEE. (PDF) Contains additional references to MRN conversion.